- minimum description length principle
- принцип минимальной длины описания
The New English-Russian Dictionary of Radio-electronics. F.V Lisovsky . 2005.
The New English-Russian Dictionary of Radio-electronics. F.V Lisovsky . 2005.
Minimum description length — The minimum description length (MDL) principle is a formalization of Occam s Razor in which the best hypothesis for a given set of data is the one that leads to the best compression of the data. MDL was introduced by Jorma Rissanen in 1978. It is … Wikipedia
Bernoulli's principle — This article is about Bernoulli s principle and Bernoulli s equation in fluid dynamics. For Bernoulli s Theorem (probability), see Law of large numbers. For an unrelated topic in ordinary differential equations, see Bernoulli differential… … Wikipedia
Structural information theory — (SIT) is a theory about human perception and, in particular, about perceptual organization, that is, about the way the human visual system organizes a raw visual stimulus into objects and object parts. SIT was initiated, in the 1960s, by Emanuel… … Wikipedia
Concept learning — Concept learning, also known as category learning, concept attainment, and concept formation, is largely based on the works of the cognitive psychologist Jerome Bruner. Bruner, Goodnow, Austin (1967) defined concept attainment (or concept… … Wikipedia
Biological network inference — Many types of biological networks exist. Few such networks are known in anything approaching their complete structure, even in the simplest bacteria. Still less is known on the parameters governing the behavior of such networks over time, how the … Wikipedia
Jorma Rissanen — Jorma J. Rissanen (born 1932 in Finland) is an information theorist, known for inventing the arithmetic coding technique of lossless data compression, and the minimum description length principle.An IBM researcher since 1960, Rissanen received… … Wikipedia
Occam's razor — For the aerial theatre company, see Ockham s Razor Theatre Company. It is possible to describe the other planets in the solar system as revolving around the Earth, but that explanation is unnecessarily complex compared to the modern consensus… … Wikipedia
Kolmogorov complexity — In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object. It is named after Soviet Russian… … Wikipedia
Statistical inference — In statistics, statistical inference is the process of drawing conclusions from data that are subject to random variation, for example, observational errors or sampling variation.[1] More substantially, the terms statistical inference,… … Wikipedia
Chris Wallace (computer scientist) — Professor Christopher Stewart Wallace (26 October 1933 7 August 2004) was an Australian computer scientist (and physicist, who also contributed to a variety of other areas) notable for having devised: The minimum message length principle (Wallace … Wikipedia
Prior probability — Bayesian statistics Theory Bayesian probability Probability interpretations Bayes theorem Bayes rule · Bayes factor Bayesian inference Bayesian network Prior · Posterior · Likelihood … Wikipedia